Finding Regulatory Motifs with Maximum Density Subgraphs
نویسندگان
چکیده
The identification of over-represented but imperfectly conserved motifs in genomic DNA is a problem with important biological applications, such as the discovery of regulatory elements that determine the timing, location, and level of gene transcription. Experimental techniques such as ChIP-chip and geneexpression microarrays can identify sets of genomic regions that are likely to be enriched for binding sites of a given transcription factor, which can then be mined computationally for an associated binding motif. This problem has been tackled many times with a number of disparate methods[4,5,6,7,8,9,10,11,12,13,14,15,16,17,19,21,29]. A thorough examination of the field has also been published [38].
منابع مشابه
MotifCut: regulatory motifs finding with maximum density subgraphs
MOTIVATION DNA motif finding is one of the core problems in computational biology, for which several probabilistic and discrete approaches have been developed. Most existing methods formulate motif finding as an intractable optimization problem and rely either on expectation maximization (EM) or on local heuristic searches. Another challenge is the choice of motif model: simpler models such as ...
متن کامل“ Topological Motifs in Cellular Networks ”
Transcriptional regulation of cellular functions is carried out through a complex network of interactions among transcription factors and the promoter regions of genes and operons regulated by them. To better understand the system-level function of such networks, simplification of their architecture was previously achieved by identifying the motifs present in the network, which are small, repea...
متن کاملOn Finding Dense Subgraphs
Given an undirected graph G = (V,E), the density of a subgraph on vertex set S is defined as d(S) = |E(S)| |S| , where E(S) is the set of edges in the subgraph induced by nodes in S. Finding subgraphs of maximum density is a very well studied problem. One can also generalize this notion to directed graphs. For a directed graph one notion of density given by Kannan and Vinay is as follows: given...
متن کاملOn Network Tools for Network Motif Finding: A Survey Study
Network motifs have been called the building blocks of networks [1]. Graph theory is used to computationally represent and search networks. Many efforts have been put into developing motif discovery tools to search for and find network motifs, patterns or subgraphs within the input network that occur more frequently in the input network than in randomized networks where patterns occur by chance...
متن کاملNetwork Motif Analysis in Clouds - Subgraph Enumeration with Iterative Hadoop MapReduce
Finding network motifs in biological networks is a computationally intensive task as it involves traversing through a large network to enumerate all possible subgraphs of a given size, and then determining their statistical uniqueness by sampling subgraphs from a large number (more than 1,000) of random graph pools. There have been parallelization efforts in the past to mitigate the computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006